Why horn formulas matter in computer science: Initial structures and generic examples
نویسندگان
چکیده
منابع مشابه
Worked Out Examples in Computer Science Tutoring
We annotated and analyzed Worked Out Examples (WOEs) in a corpus of tutoring dialogues on Computer Science data structures. We found that some dialogue moves that occur within WOEs, or sequences thereof, correlate with learning. Features of WOEs such as length also correlate with learning for some data structures. These results will be used to augment the tutorial tactics available to iList, an...
متن کاملInvestigating Knowledge Structures in Computer Science Education
To be knowledgeable in a subject matter is a prerequisite of being competent. Experts typically possess densely connected structural knowledge of the concepts in their field of expertise. Therefore, investigating the knowledge structures of learners remains a central aspect of educational research in computer science as well as in other subjects, despite the ongoing trend towards outcome and co...
متن کاملFacet - like Structures in Computer Science ?
This paper discusses how facet-like structures occur as a commonplace feature in a variety of computer science disciplines as a means for structuring class hierarchies. The paper then focuses on a mathematical model for facets (and class hierarchies in general), called formal concept analysis, and discusses graphical representations of faceted systems based on this model.
متن کاملComputer Science and Artificial Intelligence Laboratory Learning From Snapshot Examples
Examples are a powerful tool for teaching both humans and computers. In order to learn from examples, however, a student must first extract the examples from its stream of perception. Snapshot learning is a general approach to this problem, in which relevant samples of perception are used as examples. Learning from these examples can in turn improve the judgement of the snapshot mechanism, impr...
متن کاملHydras: Directed Hypergraphs and Horn Formulas
We introduce a new graph parameter, the hydra number, arising from the minimization problem for Horn formulas in propositional logic. The hydra number of a graph G = (V, E) is the minimal number of hyperarcs of the form u, v → w required in a directed hypergraph H = (V, F ), such that for every pair (u, v), the set of vertices reachable in H from {u, v} is the entire vertex set V if (u, v) ∈ E,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1987
ISSN: 0022-0000
DOI: 10.1016/0022-0000(87)90027-4